Enumeration of weighted paths on a digraph and block hook determinant
نویسندگان
چکیده
Abstract In this article, we evaluate determinants of “block hook” matrices, which are block matrices consist hook matrices. particular, deduce that the determinant a matrix factorizes nicely. addition give combinatorial interpretation aforesaid factorization property by counting weighted paths in suitable digraph.
منابع مشابه
Enumeration of digraph embeddings
A cellular embedding of an Eulerian digraph D into a closed surface is said to be directed if the boundary of each face is a directed closed walk in D. The directed genus polynomial of an Eulerian digraph D is the polynomial ΓD(x) = ∑ h≥0 gh(D)x h where gh(D) is the number of directed embeddings into the orientable surface Sh, of genus h, for h = 0, 1, . . . . The sequence {gh(D)|h ≥ 0}, which ...
متن کاملcompactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولEnumeration of area-weighted Dyck paths with restricted height
Dyck paths are directed walks on Z starting at (0, 0) and ending on the line y = 0, which have no vertices with negative y-coordinates, and which have steps in the (1, 1) and (1,−1) directions [11]. We impose the additional geometrical constraint that the paths have height at most h, that is, they lie between lines y = 0 and y = h. Given a Dyck path π, we define the length n(π) to be half the n...
متن کاملA New Determinant Expression for the Weighted Bartholdi Zeta Function of a Digraph
We consider the weighted Bartholdi zeta function of a digraph D, and give a new determinant expression of it. Furthermore, we treat a weighted L-function of D, and give a new determinant expression of it. As a corollary, we present determinant expressions for the Bartholdi edge zeta functions of a graph and a digraph.
متن کاملThe drop polynomial of a weighted digraph
Article history: Received 22 February 2016 Available online 23 April 2017 Given a directed graph D = (V, E) with n vertices and a permutation π : V → V on its vertices, we say that π has a drop at a vertex u ∈ V is (u, π(u)) is an edge of D. Letting 〈 D k 〉 denote the number of permutations on V with precisely k drops, we can define the binomial drop polynomial BD(x) = ∑ k 〈 D k 〉( x+k n ) . In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Special Matrices
سال: 2021
ISSN: ['2300-7451']
DOI: https://doi.org/10.1515/spma-2020-0130